Fast Mesh Decimation by Multiple-Choice Techniques

نویسندگان

  • Jianhua Wu
  • Leif Kobbelt
چکیده

We present a new mesh decimation framework which is based on the probabilistic optimization technique of Multiple-Choice algorithms. While producing the same expected quality of the output meshes, the Multiple-Choice approach leads to a significant speed-up compared to the wellestablished standard framework for mesh decimation as a greedy optimization scheme. Moreover, Multiple-Choice decimation does not require a global priority queue data structure which reduces the memory overhead and simplifies the algorithmic structure. We explain why and how the MultipleChoice optimization works well for the mesh decimation problem and give a detailed CPU profile analysis to explain where the speed-up comes from.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Stream Algorithm for the Decimation of Massive Meshes

We present an out-of-core mesh decimation algorithm that is able to handle input and output meshes of arbitrary size. The algorithm reads the input from a data stream in a single pass and writes the output to another stream while using only a fixed-sized in-core buffer. By applying randomized multiple choice optimization, we are able to use incremental mesh decimation based on edge collapses an...

متن کامل

Fast geodesic distance approximation using mesh decimation and front propagation

Polygon meshes are collections of vertices, edges and faces defining surfaces in a 3D environment. Computing geometric features on a polygon mesh is of major interest for various applications. Among these features, the geodesic distance is the distance between two vertices following the surface defined by the mesh. In this paper, we propose an algorithm for fast geodesic distance approximation ...

متن کامل

CPSC 548 - Directed Studies - Report Vertex-Edge Quadric for Edge Collapse Mesh Simplification

In order to preserve structural edges and shapes while simplifying the triangle mesh of man-made 3D models, we propose a new quadric error metric based on the distances between the new vertex position and the affected edges for edge collapse operations. With a 2D view sampling method, the contour and silhouette likelihood of the edges are computed, which act as the quadric’s weights during the ...

متن کامل

Fast Surface Meshing on Imperfect CAD Models

CAD model repair is often a necessary precursor to mesh generation, due primarily to the inconsistencies between the tolerances used by the designer and the tolerances required by the analyst. This paper presents a method for meshing directly on imperfect CAD models without needing to repair the model. This is done via a hierarchical grid topology structure that defines a surface grid by a mesh...

متن کامل

Mesh Decimation Using VTK

This paper describes general mesh decimation methods which operate on triangle meshes. The goal of the mesh decimation is the reduction of triangles in a mesh while preserving the shape and topology as good as possible. Further the usage of mesh decimation with the Visualization Tool Kit (VTK) is explained. Currently VTK (version 4.0, June 2002) contains four mesh decimation classes: vtkDecimat...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002